All 2-connected in-tournaments that are cycle complementary

An in-tournament is an oriented graph such that the negative neighborhood of every vertex induces a tournament. A digraph D is cycle complementary if there exist two vertex-disjoint directed cycles spanning the vertex set of D. Let D be a 2-connected in-tournament of order at least 8. In this paper we show that D is not cycle complementary if and only if it is 2-regular and has odd order.     

An accurate finite element scheme with moving meshes for computing 3D‐axisymmetric interface flows

An accurate finite element scheme for computing 3D‐axisymmetric incompressible free surface and interface flows is proposed. It is based on the arbitrary Lagrangian Eulerian (ALE) approach using free surface/interface‐resolved moving meshes. Key features like the surface force, consisting of surface tension and the local curvature, and jumps in the density and viscosity over different fluid phases are precisely incorporated in the finite element formulation. The local curvature is approximated by using the Laplace–Beltrami operator technique combined with a boundary approximation by isoparametric finite elements. A new approach is used to derive the 3D‐axisymmetric form from the variational form in 3D‐Cartesian coordinates. Several test examples show the high accuracy and the robustness of the proposed scheme. Copyright © 2007 John Wiley & Sons, Ltd.     

Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on the Size

Let D be a finite and simple digraph with vertex set V (D). The minimum degree δ of a digraph D is defined as the minimum value of its out-degrees and its in-degrees. If D is a digraph with minimum degree δ and edge-connectivity λ, then λ ≤ δ. A digraph is maximally edge-connected if λ=δ. A digraph is called super-edge-connected if every minimum edge-cut consists of edges incident to or from a vertex of minimum degree. In this note we show that a digraph is maximally edge-connected or super-edge-connected if the number of arcs is large enough.     

Transition‐Metal‐Catalyzed Direct Arylation of (Hetero)Arenes by C?H Bond Cleavage

The area of transition‐metal‐catalyzed direct arylation through cleavage of C? H bonds has undergone rapid development in recent years, and is becoming an increasingly viable alternative to traditional cross‐coupling reactions with organometallic reagents. In particular, palladium and ruthenium catalysts have been described that enable the direct arylation of (hetero)arenes with challenging coupling partners—including electrophilic aryl chlorides and tosylates as well as simple arenes in cross‐dehydrogenative arylations. Furthermore, less expensive copper, iron, and nickel complexes were recently shown to be effective for economically attractive direct arylations.     

The <Emphasis Type="Italic">k</Emphasis>-domatic number of a graph

Let k be a positive integer, and let G be a simple graph with vertex set V (G). A k-dominating set of the graph G is a subset D of V (G) such that every vertex of V (G)-D is adjacent to at least k vertices in D. A k-domatic partition of G is a partition of V (G) into k-dominating sets. The maximum number of dominating sets in a k-domatic partition of G is called the k-domatic number d _k (G). In this paper, we present upper and lower bounds for the k-domatic number, and we establish Nordhaus-Gaddum-type results. Some of our results extend those for the classical domatic number d(G) = d ₁(G).